A Secure Anonymous E-Voting System based on Discrete Logarithm Problem
نویسندگان
چکیده
In this paper, we propose a practical and secure anonymous Internet voting protocol. This method integrates Internet reality and cryptology. Issues such as the kinds of “certificate authority” and “public proxy server” are integrated in our scheme to solve the Internet identification and anonymity problems. To combine and make up a series of ElGamal blind signature and secret sharing cryptosystem, this protocol can be applied to a secure, practical, and fair voting system.
منابع مشابه
Double voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملProvably Secure Blind Threshold Signatures Based on Discrete Logarithm
In this paper, we propose a provably secure group-oriented blind (t, n) threshold signature scheme, which is the first scheme whose security is proved to be equivalent to the discrete logarithm problem in the random oracle model. Based on the scheme, any t out of n signers in a group can represent the group in signing blind threshold signatures, which can be used in anonymous digital e-cash sys...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملSecured Proxy Blind Signature Scheme Based on Dlp with Minimum Computation Cost
Proxy blind signature is a combination 0f both the properties of proxy signature and blind signature scheme. This scheme is useful in many applications like e-voting, e-payment and mobile agent environments. This paper presents a new proxy blind signature scheme based on discrete logarithm problem(DLP), which satisfies the secure properties of both the blind signature scheme and the proxy signa...
متن کامل